Busy Beaver – An Evolutionary Approach
نویسندگان
چکیده
The Busy Beaver is an interesting theoretical problem proposed by Tibor Rado in 1962. Since then, it has attracted the attention of many researchers and several contests were organised trying to produce good solutions. In this paper, we propose an evolutionary approach to the problem. Our experimental results prove that this technique is very effective in attacking Busy Beaver, since we were able to find several Turing machines that outperform previous best-known solutions.
منابع مشابه
Busy Beaver - The Influence of Representation
The Busy Beaver is an interesting theoretical problem proposed by Rado in 1962, in the context of the existence of non computable functions. In this paper we propose an evolutionary approach to this problem. We will focus on the representational issues, proposing alternative ways of codifying and interpreting Turing Machines, designed to take advantage of the existence of sets of equivalent Tur...
متن کاملUnderstanding the Role of Learning in the Evolution of Busy Beavers: a Comparison Between the Baldwin Effect and a Lamarckian Strategy
In this paper we study how individual learning interacts with an evolutionary algorithm in its search for good solutions to the Busy Beaver problem. Two learning strategies, the Baldwin Effect and Lamarckian learning, are compared with an extensive set of experiments. Results show that the Baldwin Effect is less sensitive to specific issues concerning the definition of the learning model and it...
متن کاملThe Influence of Learning in the Evolution of Busy Beavers
The goal of this research is to study how individual learning interacts with an evolutionary algorithm in its search for good candidates for the Busy Beaver problem. Two learning models, designed to act as local search procedures, are proposed. Experimental results show that local search methods that are able to perform several modifications in the structure of an individual in each learning st...
متن کاملToo Busy to Learn
The goal of this research is to analyze how individual learning interacts with an evolutionary algorithm in its search for best candidates for the Busy Beaver problem. To study this interaction two learning models, implemented as local search procedures, are proposed. Experimental results show that, in highly irregular and prone to premature convergence search spaces, local search methods are n...
متن کاملAttacking the Busy Beaver 5
Since T. Rado in 1962 defined the busy beaver game several approaches have used computer technology to search busy beavers or even compute special values of Σ. Σ(5) is not yet known. A new approach to the computation of Σ(5) is presented, together with preliminary results, especially Σ(5)≥4098. This approach includes techniques to reduce the number of inspected Turing machines, to accelerate si...
متن کامل